A parallel algorithm for solving block tridiagonal linear systems
نویسندگان
چکیده
منابع مشابه
Parallel Strategy for Solving Block-Tridiagonal Linear Systems
Efficient parallel iterative algorithm is investigated for solving block-tridiagonal linear systems on distributed-memory multi-computers. Based on Galerkin theory, the communication only need twice between the adjacent processors per iteration step. Furthermore, the condition for convergence was given when the coefficient matrix A is a symmetric positive definite matrix. Numerical experiments ...
متن کاملAn hybrid parallel algorithm for solving tridiagonal linear systems
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP...
متن کاملAn hybrid parallel algorithm for solving tridiagonal linear systems
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP...
متن کاملSome algorithms for solving special tridiagonal block Toeplitz linear systems
This paper is focused on di1erent methods and algorithms for solving tridiagonal block Toeplitz systems of linear equations. We consider the El-Sayed method (Ph.D. Thesis, 1996) for such systems and propose several modi9cations that lead to di1erent algorithms, which we discuss in detail. Our algorithms are then compared with some classical techniques as far as implementation time is concerned,...
متن کاملA Parallel Algorithm for Circulant Tridiagonal Linear Systems
In this paper, based upon the divide-and-conquer strategy, we propose a parallel algorithm for solving the circulant tridiagonal systems, which is simpler than the two previous algorithms proposed by Agui and Jimenez ( 1995) and Chung et al. ( 1995). Our algorithm can be easily generalized to solve the tridiagonal systems, the block-tridiagonal systems, and the circulant block-tridiagonal syste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1992
ISSN: 0898-1221
DOI: 10.1016/0898-1221(92)90003-z